Semi-ideals in semi-lattices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterization of L-Fuzzy Semi-Filters and Semi-Ideals

Lattice-valued up-sets and down-sets of a poset are investigated under the cutworthy approach. It is proved that the collections of all lattice valued up-sets and down-sets of a given poset are complete lattices under fuzzy inclusion. Properties of these are investigated. For a given collection of crisp up-sets of a poset, necessary and sufficient conditions are given under which the family rep...

متن کامل

Generalized Semi-ideals in Ternary Semirings

We introduce the notion of a generalized semi-ideal in a ternary semiring. Various examples to establish a relationship between ideals, bi-ideals, quasi-ideals and generalized semi-ideals are furnished. A criterion for a commutative ternary semiring without any divisors of zero to a ternary division semiring is given. AMS Mathematics Subject Classification (2010): 16Y60, 16Y99

متن کامل

On Semi Prime Ideals in Nearlattices

Recently Yehuda Rav has given the concept of Semi prime ideals in a general lattice by generalizing the notion of 0-distributive lattices. In this paper we study several properties of these ideals in a general nearlattice and include some of their characterizations. We give some results regarding maximal filters and include a number of Separation properties in a general nearlattice with respect...

متن کامل

Completion of Lattices of Semi-continuous Functions

If U and V are topologies on an abstract set X, then the triple (X, U, V) is a bitopological space. Using the theorem of Priestley on the representation of distributive lattices, results of Dilworth concerning the normal completion of the lattice of bounded, continuous, realvalued functions on a topological space are extended to include the lattice of bounded, semi-continuous, real-valued funct...

متن کامل

Semi-primary Lattices and Tableau Algorithms

We develop the theory of semi-primary lattices, a class of modular lattices, including abelian subgroup lattices and invariant subspace lattices, in which an integer partition is assigned to every element and every interval. Flags in these lattices give rise to chains of partitions, which may be encoded as tableaux. In certain of these lattices, Steinberg and van Leeuwen respectively have shown...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1974

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-30-2-203-212